Black-box recognition of finite simple groups of Lie type by statistics of element orders
نویسندگان
چکیده
منابع مشابه
Black-box recognition of finite simple groups of Lie type by statistics of element orders
Given a black-box group G isomorphic to some finite simple group of Lie type and the characteristic of G, we compute the standard name of G by a Monte Carlo algorithm. The running time is polynomial in the input length and in the time requirement for the group operations in G. The algorithm chooses a relatively small number of (nearly) uniformly distributed random elements of G, and examines th...
متن کاملBlack Box Exceptional Groups of Lie Type
If a black box group is known to be isomorphic to an exceptional simple group of Lie type of (twisted) rank > 1, other than any F4(q), over a field of known size, a Las Vegas algorithm is given to produce a constructive isomorphism. In view of its timing, this algorithm yields an upgrade of all known nearly linear time Monte Carlo permutation group algorithms to Las Vegas algorithms when the in...
متن کاملLarge element orders and the characteristic of Lie-type simple groups
Given a matrix group G = 〈X〉 GL(d,q), specified by a set X of generators, it seems that a full structural exploration of G is necessary in order to answer even the simplest questions concerning G , such as finding |G| or testing the membership of any given matrix in G (cf. [LG,BB]). Currently, the standard approach to such an exploration is to set up a recursive scheme of homomorphisms, breakin...
متن کاملBlack box exceptional groups of Lie type II
Article history: Received 29 April 2014 Available online 17 September 2014 Communicated by Charles Leedham-Green MSC: primary 20D06, 20G40 secondary 20B40, 20G41, 20P05, 68Q25
متن کاملGrowth in Finite Simple Groups of Lie Type
We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A| where ε depends only on the Lie rank of L, or AAA = L. This implies that for a family of simple groups L of Lie type of bounded rank the diameter of any Cayley graph is polylogarithmic in |L|. Combining our result on growth with known results of Bourgain, Gamburd and Va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Group Theory
سال: 2002
ISSN: 1433-5883,1435-4446
DOI: 10.1515/jgth.2002.010